New Constructions of Lotto Designs
نویسندگان
چکیده
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set intersects at least one k-set in t or more elements. Let L(n, k, p, t) denote the minimum number of blocks in any LD(n, k, p, t; b) Lotto Design. We shall discuss several techniques for constructing Lotto designs and determining upper bounds for L(n, k, p, t).
منابع مشابه
Uniform Designs and Their Combinatorial Constructions
Uniform designs has been widely used in various fields. In this talk, two constructions for uniform designs from combinatorics are presented. One is obtained by resolvable PPBDs which serves to unify some known combinatorial constructions. The other provides a recursive method to obtain a new three-level uniform design from old one.
متن کاملNew Analytic Method for Subgrade Settlement Calculation of the New Cement Fly-ash Grave Pile-slab Structure
At present, reducing subgrade settlement of soft soil foundation is a key problem in high-speed railway construction. Pile-slab structure is a widely-utilized form of foundation structure to reduce the subgrade settlement in China. In order to save the engineering cost for high-speed railway construction in developing countries, the author developed a pile-slab structure and named it as the new...
متن کاملSome Constructions of General Covering Designs
Given five positive integers v,m, k, λ and t where v > k > t and v > m > t, a t-(v, k,m, λ) general covering design is a pair (X,B) where X is a set of v elements (called points) and B a multiset of k-subsets of X (called blocks) such that every m-subset of X intersects (is covered by) at least λ members of B in at least t points. In this article we present new constructions for general coverin...
متن کاملThe Stein-Lovász Theorem and Its Applications to Some Combinatorial arrays
The Stein-Lovász Theorem can be used to get existence results for some combinatorial problems using constructive methods rather than probabilistic methods. In this paper, we discuss applications of the Stein-Lovász Theorem to some combinatorial set systems and arrays, including perfect hash families, separating hash families, splitting systems, covering designs, lotto designs and ∆-free systems...
متن کاملSome Patterned Constructions of Rectangular Designs
This paper describes some new patterned methods of constructing rectangular designs from balanced incomplete block (BIB) designs and nested BIB designs, and gives a table of rectangular designs in the range of r, k ≤ 10.
متن کامل